Realizations of Loops and Groups defined by short identities
نویسنده
چکیده
In a recent paper, those quasigroup identities involving at most three variables and of “length” six which force the quasigroup to be a loop or group have been enumerated by computer. We separate these identities into subsets according to what classes of loops they define and also provide humanlycomprehensible proofs for most of the computer-generated results.
منابع مشابه
Braids, Q-binomials and Quantum Groups
The classical identities between the q-binomial coefficients and factorials can be generalized to a context where numbers are replaced by braids. More precisely, for every pair i, n of natural numbers, there is defined an element b (n) i of the braid group algebra kBn, and these satisfy analogs of the classical identities for the binomial coefficients. By choosing representations of the braid g...
متن کاملPolynomial Identities for Tangent Algebras of Monoassociative Loops
We introduce degree n Sabinin algebras, which are defined by the polynomial identities up to degree n in a Sabinin algebra. Degree 4 Sabinin algebras can be characterized by the polynomial identities satisfied by the commutator, associator and two quaternators in the free nonassociative algebra. We consider these operations in a free power associative algebra and show that one of the quaternato...
متن کاملOn bounded weak approximate identities and a new version of them
In this paper, we give a short survey of results and problems concerning the notion of bounded weak approximate identities in Banach algebras. Also, we introduce a new version of approximate identities and give one illuminating example to show the difference.
متن کاملThe Connection between the Number of Realizations for Degree Sequences and Majorization
The graph realization problem is to find for given nonnegative integers a1, . . . , an a simple graph (no loops or multiple edges) such that each vertex vi has degree ai. Given pairs of nonnegative integers (a1, b1), . . . , (an, bn), (i) the bipartite realization problem ask whether there is a bipartite graph (no loops or multiple edges) such that vectors (a1, ..., an) and (b1, ..., bn) corres...
متن کاملOn the Swap-Distances of Different Realizations of a Graphical Degree Sequence
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is graphical for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010